Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Constraint programming (Computer science) --- Programmation par contraintes --- 681.3*D16 --- 681.3*D13 --- Computer programming --- Computerwetenschap--?*D16 --- Concurrent programming --- 681.3*D13 Concurrent programming

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

This book constitutes the thoroughly refereed post-proceedings of the 12th International Workshop on Logic Based Program Synthesis and Transformation, LOPSTR 2002, held in Madrid, Spain in September 2002. The 15 revised full papers presented together with 7 abstracts were carefully selected during two rounds of reviewing and revision from 40 submissions. The papers are organized in topical sections on debugging and types, tabling and constraints, abstract interpretation, program refinement, verification, partial evaluation, and rewriting and object-oriented development.

Logic programming --- Computer Science --- Engineering & Applied Sciences --- 681.3*D16 --- 681.3*D11 --- 681.3*F31 --- 681.3*F41 --- 681.3*I22 --- Computerwetenschap--?*D16 --- Applicative (functional) programming --- Specifying anf verifying and reasoning about programs: assertions; invariants; mechanical verification; pre- and post-conditions (Logics and meanings of programs)--See also {681.3*D21}; {681.3*D24}; {681.3*D31}; {681.3*E1} --- Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- Automatic programming: automatic analysis of algorithms; program modification; program synthesis; program transformation; program verification (Artificialintelligence)--See also {681.3*D12}; {681.3*F31} --- 681.3*I22 Automatic programming: automatic analysis of algorithms; program modification; program synthesis; program transformation; program verification (Artificialintelligence)--See also {681.3*D12}; {681.3*F31} --- 681.3*F41 Mathematical logic: computability theory; computational logic; lambda calculus; logic programming; mechanical theorem proving; model theory; proof theory;recursive function theory--See also {681.3*F11}; {681.3*I22}; {681.3*I23} --- 681.3*F31 Specifying anf verifying and reasoning about programs: assertions; invariants; mechanical verification; pre- and post-conditions (Logics and meanings of programs)--See also {681.3*D21}; {681.3*D24}; {681.3*D31}; {681.3*E1} --- 681.3*D11 Applicative (functional) programming --- Computer science. --- Science. --- Computer programming. --- Computer logic. --- Mathematical logic. --- Computer Science. --- Logics and Meanings of Programs. --- Science, general. --- Programming Techniques. --- Mathematical Logic and Formal Languages. --- Algebra of logic --- Logic, Universal --- Mathematical logic --- Symbolic and mathematical logic --- Symbolic logic --- Mathematics --- Algebra, Abstract --- Metamathematics --- Set theory --- Syllogism --- Computer science logic --- Logic, Symbolic and mathematical --- Computers --- Electronic computer programming --- Electronic data processing --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory --- Natural science --- Science of science --- Sciences --- Informatics --- Science --- Programming --- Logic design. --- Science, Humanities and Social Sciences, multidisciplinary. --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Machine theory --- Switching theory

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Programming --- Object-oriented programming (Computer science) --- Java (Computer program language) --- 681.3*D2 --- Object-oriented programming languages --- JavaSpaces technology --- Computer programming --- Object-oriented methods (Computer science) --- Document Object Model (Web site development technology) --- Software engineering: protection mechanisms; standards--See also {681.3*K63}; {681.3*K51} --- 681.3*D2 Software engineering: protection mechanisms; standards--See also {681.3*K63}; {681.3*K51} --- Computer Science --- Engineering & Applied Sciences

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Operating systems (Computers) --- Systèmes d'exploitation (Ordinateurs) --- Linux. --- 681.3*D4 --- Computer operating systems --- Computers --- Disk operating systems --- Systems software --- Operating systems--See also {681.3*C} --- Operating systems --- Operating systems (Computers). --- 681.3*D4 Operating systems--See also {681.3*C} --- Systèmes d'exploitation (Ordinateurs) --- Slackware Linux --- SUSE Linux

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Overview The motivation of this text lies in what we believe is the inadequacy of current frameworks to reason about the ?ow of data in imperative programs. This inadequacy clearly shows up when dealing with the individual side effects of loop iterations. - deed, we face a paradoxical situation where, on the one hand, a typical program spends most of its execution time iterating or recursing on a few lines of codes, and, on the other hand, current optimization frameworks are clumsy when trying to capture the effects of each incarnation of these few lines—frameworks we inherited from designs made decades ago. The reasons are manyfold, but one of them stands out: The same concepts have been used, on the one hand, to represent and manipulate programs internally in compilers and, on the other hand, to allow us humans to reason about optimizations. Unfortunately, these two uses have different aims and constraints. An example of such a situation is given by control-?ow graphs of basic blocks, which have been - tremely useful in practice as an internal representation of programs, but which are not always adequate or convenient to formally think about programs and specify their transformations. In some cases, de?nitions based on control-?ow graphs can be overly restrictive. Dominance, studied in Chapter 4, is a good example.

Programming --- Programming languages (Electronic computers) --- Langages de programmation --- 681.3*I22 --- Computer languages --- Computer program languages --- Computer programming languages --- Machine language --- Electronic data processing --- Languages, Artificial --- Automatic programming: automatic analysis of algorithms; program modification; program synthesis; program transformation; program verification (Artificialintelligence)--See also {681.3*D12}; {681.3*F31} --- Programming languages (Electronic computers). --- Computer Science --- Engineering & Applied Sciences --- 681.3*I22 Automatic programming: automatic analysis of algorithms; program modification; program synthesis; program transformation; program verification (Artificialintelligence)--See also {681.3*D12}; {681.3*F31} --- Computer science. --- Computer programming. --- Computer Science. --- Programming Languages, Compilers, Interpreters. --- Programming Techniques. --- Computers --- Electronic computer programming --- Electronic digital computers --- Programming (Electronic computers) --- Coding theory